Can we Rely on SQL?

نویسنده

  • J. H. ter Bekke
چکیده

It is important for any data language that it enables many people to derive correct information from a databases in a simple, effective way with predictable performance. In an analysis is shown that SQL cannot fulfill these essential preconditions. It is caused by insufficient structural semantics of the relational model and the related operations in SQL. This follows from a comparison with results obtained from application of the semantic Xplain data language. The consequences of these shortcomings are an extreme performance degradation and a growing uncertainty among SQL users.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RDF Modelling and SPARQL Processing of SQL Abstract Syntax Trees

Syntax Trees Corentin Follenfant, Olivier Corby, Fabien Gandon, and David Trastour 1 INRIA Sophia Antipolis Méditerranée [email protected] 2 SAP Research [email protected] Abstract. Most enterprise systems rely on relational databases, and therefore SQL queries, to populate dynamic documents such as business intelligence reports, dashboards or spreadsheets. These queries repr...

متن کامل

Query2Vec: NLP Meets Databases for Generalized Workload Analytics

We consider methods for learning vector representations of SQL queries to support generalized workload analytics tasks, including workload summarization for index selection and predicting queries that will trigger memory errors. We consider vector representations of both raw SQL text and optimized query plans, and evaluate these methods on synthetic and real SQL workloads. We find that general ...

متن کامل

Evaluating SPARQL-to-SQL Translation in Ontop

In this paper we evaluate the performance of the SQL queries generated by ontop, a system that uses a formal approach to translate and optimize SPARQL queries and R2RML mappings. We show that the performance of ontop’s SQL queries is superior to that of the performance of well known systems that rely on SQL to execute SPARQL, and superior to to that of well-known triple stores. We highlight som...

متن کامل

Overcoming Limitations of Sampling for Aggregation Queries

We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attribute is skewed. To address this issue, we introduce a technique called outlier-indexing. Uniform sampling is also ineffective for queries with low selectivity. We rely on weighted sampling based on workload information ...

متن کامل

SQLNet: Generating Structured Queries From Natural Language Without Reinforcement Learning

Synthesizing SQL queries from natural language is a long-standing open problem and has been attracting considerable interest recently. Toward solving the problem, the de facto approach is to employ a sequence-to-sequence-style model. Such an approach will necessarily require the SQL queries to be serialized. Since the same SQL query may have multiple equivalent serializations, training a sequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997